Linda Williams’ „Hard Core“

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hard-Core Distributions for Somewhat Hard Problems

Consider a decision problem that cannot be 1 ? approximated by circuits of a given size in the sense that any such circuit fails to give the correct answer on at least a fraction of instances. We show that for any such problem there is a speciic \hard-core" set of inputs which is at least a fraction of all inputs and on which no circuit of a slightly smaller size can get even a small advantage ...

متن کامل

Hard Core entropy: lower bounds

We establish lower bounds for the entropy of the Hard Core Model on a few 2d lattices L. In this model the allowed configurations inside {0,1} are the one’s in which the nearest neighbor 1’s are forbidden. Our method which is based on a sequential fill-in scheme is unbiassed and thereby yields in principle arbitrarily good estimates for the topological entropy. The procedure also gives some det...

متن کامل

Boosting and Hard-Core Sets

This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosting, a technique from computational learning theory. Using this connection we give fruitful applications of complexity-theoretic techniques to learning theory and vice versa. We show that the hard-core set construction ...

متن کامل

Linda

Also participating: Arden L. Bement, Jr., Director, National Science Foundation Jonathan Bagger, Departments of Physics and Astronomy and Mathematics, Johns Hopkins University Gary Bernstein, Department of Physics and Astronomy, University of Pennsylvania Joel Butler, Particle Physics Division, Fermi National Accelerator Laboratory Aesook Byon-Wagner, Office of High Energy Physics, Office of Sc...

متن کامل

P4-Linda: A Portable Implementation of Linda

Facilities such as interprocess communication and protection of shared resources have been added to operating systems to support multiprogramming and have since been adapted to exploit explicit multiprocessing within the scope of two models: the shared-memory model and the distributed (message-passing) model. When multiprocessors (or networks of heterogeneous processors) are used for explicit p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Zeitschrift für Sexualforschung

سال: 2019

ISSN: 0932-8114,1438-9460

DOI: 10.1055/a-0835-1668